Advanced MCMC methods for sampling on diffusion pathspace
نویسندگان
چکیده
منابع مشابه
Mcmc Methods for Diffusion Bridges
We present and study a Langevin MCMC approach for sampling nonlinear diffusion bridges. The method is based on recent theory concerning stochastic partial differential equations (SPDEs) reversible with respect to the target bridge, derived by applying the Langevin idea on the bridge pathspace. In the process, a Random-Walk Metropolis algorithm and an Independence Sampler are also obtained. The ...
متن کاملMCMC Methods for Sampling Function Space
Applied mathematics is concerned with developing models with predictive capability, and with probing those models to obtain qualitative and quantitative insight into the phenomena being modelled. Statistics is data-driven and is aimed at the development of methodologies to optimize the information derived from data. The increasing complexity of phenomena that scientists and engineers wish to mo...
متن کاملSampling Strategies for MCMC
There are many good methods for sampling Markov chains via streams of independent U [0, 1] random variables. Recently some non-random and some random but dependent driving sequences have been shown to result in consistent Markov chain sampling, sometimes with considerably improved accuracy. The key to consistent sampling is for the driving sequence to be completely uniformly distributed (CUD) o...
متن کاملOrthogonal parallel MCMC methods for sampling and optimization
Monte Carlo (MC) methods are widely used in statistics, signal processing and machinelearning. A well-known class of MC methods are Markov Chain Monte Carlo (MCMC)algorithms. In order to foster better exploration of the state space, specially in high-dimensional applications, several schemes employing multiple parallel MCMC chains have beenrecently introduced. In this work, ...
متن کاملControlled MCMC for Optimal Sampling
In this paper we develop an original and general framework for automatically optimizing the statistical properties of Markov chain Monte Carlo (MCMC) samples, which are typically used to evaluate complex integrals. The Metropolis-Hastings algorithm is the basic building block of classical MCMC methods and requires the choice of a proposal distribution, which usually belongs to a parametric fami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2013
ISSN: 0304-4149
DOI: 10.1016/j.spa.2012.12.001